An automatic critical care urine meter

Nowadays patients admitted to critical care units have most of their physiological parameters measured automatically by sophisticated commercial monitoring devices. More often than not, these devices supervise whether the values of the parameters they measure lie within a pre-established range, and issue warning of deviations from this range by triggering alarms. The automation of measuring and supervising tasks not only discharges the healthcare staff of a considerable workload but also avoids human errors in these repetitive and monotonous tasks. Arguably, the most relevant physiological parameter that is still measured and supervised manually by critical care unit staff is urine output (UO). In this paper we present a patent-pending device that provides continuous and accurate measurements of patient’s UO. The device uses capacitive sensors to take continuous measurements of the height of the column of liquid accumulated in two chambers that make up a plastic container. The first chamber, where the urine inputs, has a small volume. Once it has been filled it overflows into a second bigger chamber. The first chamber provides accurate UO measures of patients whose UO has to be closely supervised, while the second one avoids the need for frequent interventions by the nursing staff to empty the containe

Family and identity. Catholic and non-Catholic intermarriage: attitudes to children, identity and sharing household responsibilities

info:eu-repo/semantics/publishe

Особливості формування етнічного складу селянської верстви Степового Побужжя

In this short paper we sketch a brief introduction to our Krimp algorithm. Moreover, we briefly discuss some of the large body of follow up research. Pointers to the relevant papers are provided in the bibliography

Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules

Association rules are among the most widely employed data analysis methods in the field of Data Mining. An association rule is a form of partial implication between two sets of binary variables. In the most common approach, association rules are parameterized by a lower bound on their confidence, which is the empirical conditional probability of their consequent given the antecedent, and/or by some other parameter bounds such as "support" or deviation from independence. We study here notions of redundancy among association rules from a fundamental perspective. We see each transaction in a dataset as an interpretation (or model) in the propositional logic sense, and consider existing notions of redundancy, that is, of logical entailment, among association rules, of the form "any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant". We discuss several existing alternative definitions of redundancy between association rules and provide new characterizations and relationships among them. We show that the main alternatives we discuss correspond actually to just two variants, which differ in the treatment of full-confidence implications. For each of these two notions of redundancy, we provide a sound and complete deduction calculus, and we show how to construct complete bases (that is, axiomatizations) of absolutely minimum size in terms of the number of rules. We explore finally an approach to redundancy with respect to several association rules, and fully characterize its simplest case of two partial premises.Comment: LMCS accepted pape

Children's game library as a Unique Extracurricular Educational Establishment in the USSR (the middle of the 20th century)

The article reveals the history of emergence and work of children's game libraries in the USSR in the middle of the 20th century. The first children's game libraries, which were educational establishments where children could come and play different games, using various game and sport equipment free of charge, appeared in the 1930th and became wide spread in the USSR in the 1930th - 1950th. Children's game libraries had different tasks of their work (organizing children's cultural leisure time, increasing the educational and political levels of children's games and entertainments which were conducted in schools, summer camps and extracurricular educational establishments). They also had different directions of their work, namely: organizational, methodic, educational, experimental, instructive and consultative directions. It has been shown in the article that children’s game libraries had great results of their work (they involved a lot of children and adults in their activities; the network of children's game libraries began to grow; a lot of new toys and games were created and produced by them). However, children's game libraries faced certain difficulties in their work, namely: absence of own premises of children’s game libraries, lack of enough support for their activities by some educational institutions and teaching staff, lack of the required amount of toys and games, insufficient instructive and publishing activities of children’s game libraries

Document Analysis Research in the Year 2021

The original publication is available at www.springerlink.comInternational audienceDespite tremendous advances in computer software and hardware, certain key aspects of experimental research in document analysis, and pattern recognition in general, have not changed much over the past 50 years. This paper describes a vision of the future where community-created and managed resources make possible fundamental changes in the way science is conducted in such fields. We also discuss current developments that are helping to lead us in this direction

Optimal constraint-based decision tree induction from itemset lattices

International audienceIn this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard problem of finding optimal decision trees in a wide range of applications by post-processing a set of patterns: we use local patterns to construct a global model. We exploit the connection between constraints in pattern mining and constraints in decision tree induction to develop a framework for categorizing decision tree mining constraints. This framework allows us to determine which model constraints can be pushed deeply into the pattern mining process, and allows us to improve the state-of-the-art of optimal decision tree induction

Studies of new Higgs boson interactions through nonresonant HH production in the b¯bγγ fnal state in pp collisions at √s = 13 TeV with the ATLAS detector

A search for nonresonant Higgs boson pair production in the b ¯bγγ fnal state is performed using 140 fb−1 of proton-proton collisions at a centre-of-mass energy of 13 TeV recorded by the ATLAS detector at the CERN Large Hadron Collider. This analysis supersedes and expands upon the previous nonresonant ATLAS results in this fnal state based on the same data sample. The analysis strategy is optimised to probe anomalous values not only of the Higgs (H) boson self-coupling modifer κλ but also of the quartic HHV V (V = W, Z) coupling modifer κ2V . No signifcant excess above the expected background from Standard Model processes is observed. An observed upper limit µHH < 4.0 is set at 95% confdence level on the Higgs boson pair production cross-section normalised to its Standard Model prediction. The 95% confdence intervals for the coupling modifers are −1.4 < κλ < 6.9 and −0.5 < κ2V < 2.7, assuming all other Higgs boson couplings except the one under study are fxed to the Standard Model predictions. The results are interpreted in the Standard Model efective feld theory and Higgs efective feld theory frameworks in terms of constraints on the couplings of anomalous Higgs boson (self-)interactions